Selective Maintenance & Redundancy Allocation Problem with Interval Coefficients

This article is an attempt to obtain a compromise allocation of a reliability optimization problem in case of maintenance components and in case of redundancy. In first case, time taken and the cost spent on system maintenance is minimized simultaneously for the required reliability R* (say) and in case second cost, weight and volume of the system is minimized simultaneously for the required reliability R* (say). Since in real world problems decision makers do not know the precise value of parameters like time, cost, weight, volume etc, therefore, to deal with these uncertainties we assume these parameters as interval numbers. The problem of obtaining compromise allocation is formulated as Bi-Objective Selective Maintenance Allocation Problem (BSMAP) and Redundancy Allocation Problem (RAP) with interval coefficients in the objective functions and solved by goal programming technique with separation method. A numerical example is also presented to illustrate the computational details.